#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e4+100;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
string ss[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++){
    cin>>ss[i];
    sort(ss[i].begin(),ss[i].end());
  }
  LL q;cin>>q;
  while(q--){
     string s;cin>>s;
     sort(s.begin(),s.end());
     LL ans=0;
     for(LL i=1;i<=n;i++){
         if(ss[i]==s){
            ans++;
         }
     }
     cout<<ans<<"\n";
  }
return 0;
}
